#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,ans,a[100005];
map<ll,ll>m;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i],m[a[i]]++;
    sort(a+1,a+n+1);
    for(int i=1;i<=100000;i++){
        if(m[i])ans=max(0*1ll,ans-m[i])+m[i];
    }
    cout<<ans;
    return 0;
}
